NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
681	Bandwidth Approximation of a Restricted Family of Trees Abstract Bandwidth is one of the canonical NP-complete problemsIt is NP-hard to approximate within any constant, even on treesGupta gave a randomized Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2009-12-02 23:05:21 NP-complete problems Tree Clique Path decomposition Graph coloring Graph theory Theoretical computer science Mathematics
682	Fast Normalized Cut with Linear Constraints Linli Xu Wenye Li Dale Schuurmans Department of Computing Science University of Alberta Add to Reading List Source URL: webdocs.cs.ualberta.ca Language: English - Date: 2009-04-06 23:13:13 Matrix theory Mathematical optimization NP-complete problems Operations research Eigenvalues and eigenvectors Spectral clustering Graph partition Eigendecomposition of a matrix Segmentation Algebra Mathematics Linear algebra
683	Maximizing Social Influence in Nearly Optimal Time Christian Borgs∗ Michael Brautbar† Jennifer Chayes‡ Add to Reading List Source URL: arxiv.org Language: English - Date: 2013-09-22 20:59:44 NP-complete problems Hypergraph Submodular set function Bridge Graph partition Network theory Networks Belief propagation Randomized algorithm Graph theory Theoretical computer science Mathematics
684	Logic Puzzles booklet #4 ©Tim Peeters (http://www.home.zonnet.nl/kostunix/) Magic Square #1 (*) In every row, every column and on the two diagonals every number from 1 to 9 appears exactly once. Some number Add to Reading List Source URL: www.home.zonnet.nl Language: English - Date: 2002-07-22 15:35:11** Games Crossword Human behavior Publishing Sudoku Puzzle video games NP-complete problems Logic puzzles Leisure
685	k Newsletter of the Parameterized Complexity Community fpt.wikidot.com www.fpt.wikidot.com Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2014-10-14 03:31:39 Complexity classes NP-complete problems Analysis of algorithms Parameterized complexity Michael Fellows Kernelization Clique problem Vertex cover Path decomposition Theoretical computer science Computational complexity theory Applied mathematics
686	Concurrent Bounded Model Checking Quoc-Sang Phan Pasquale Malacaria ˘ areanu Add to Reading List Source URL: www.eecs.qmul.ac.uk Language: English - Date: 2015-04-10 18:09:41 Formal methods Logic in computer science Electronic design automation NP-complete problems Model checking Java Pathfinder Satisfiability Modulo Theories Concolic testing KeY Theoretical computer science Applied mathematics Mathematics
687	Local reductions Hamid Jahanjou∗ Eric Miles∗ Emanuele Viola∗ Add to Reading List Source URL: www.ccs.neu.edu Language: English - Date: 2014-04-01 09:13:02 Complexity classes Circuit complexity Boolean algebra NP-complete problems Time complexity ACC0 Cook–Levin theorem P NC Theoretical computer science Computational complexity theory Applied mathematics
688	The Mathematics of Algorithm Design about all these algorithms without recourse to specific computing devices or computer programming languages, instead expressing them using the language of mathematics. In fact, the not Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2006-02-14 23:00:29 Complexity classes Mathematical optimization NP-complete problems Operations research Travelling salesman problem Algorithm Minimum spanning tree Combinatorial optimization Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
689	Stochastic Local Search for SMT: Combining Theory Solvers with WalkSAT ? Alberto Griggio1 , Quoc-Sang Phan2 , Roberto Sebastiani2 and Silvia Tomasi2 Add to Reading List Source URL: disi.unitn.it Language: English - Date: 2011-10-12 05:34:03 Mathematics Logic in computer science NP-complete problems Electronic design automation Formal methods Satisfiability Modulo Theories WalkSAT Resolution Local search Theoretical computer science Constraint programming Applied mathematics
690	Journal of Artificial Intelligence Research606 Submitted 11/07; publishedSATzilla: Portfolio-based Algorithm Selection for SAT Lin Xu Add to Reading List Source URL: www.jair.org Language: English - Date: 2008-07-01 13:34:37 NP-complete problems Logic in computer science Electronic design automation Formal methods Boolean algebra Boolean satisfiability problem Algorithm Computational complexity theory Solver Theoretical computer science Applied mathematics Mathematics

UPDATE